On the Fewest Nets Problem for Convex Polyhedra
نویسنده
چکیده
Given a convex polyhedron with n vertices and F faces, what is the fewest number of pieces, each of which unfolds to a simple polygon, into which it may be cut by slices along edges? Shephard’s conjecture says that this number is always 1, but it’s still open. The fewest nets problem asks to provide upper bounds for the number of pieces in terms of n and/or F . We improve the previous best known bound of F/2 by proving that every convex polyhedron can be unfolded into no more than 3F/8 non-overlapping nets. If the polyhedron is triangulated, the upper bound we obtain is 4F/11.
منابع مشابه
Modelling Decision Problems Via Birkhoff Polyhedra
A compact formulation of the set of tours neither in a graph nor its complement is presented and illustrates a general methodology proposed for constructing polyhedral models of decision problems based upon permutations, projection and lifting techniques. Directed Hamilton tours on n vertex graphs are interpreted as (n-1)- permutations. Sets of extrema of Birkhoff polyhedra are mapped to tours ...
متن کاملSymbolic State Space of Stopwatch Petri Nets with Discrete-Time Semantics (Theory Paper)
In this paper, we address the class of bounded Petri nets with stopwatches (SwPNs), which is an extension of T-time Petri nets (TPNs) where time is associated with transitions. Contrary to TPNs, SwPNs encompass the notion of actions that can be reset, stopped and started. Models can be defined either with discrete-time or dense-time semantics. Unlike dense-time, discrete-time leads to combinato...
متن کاملCS - 1993 - 09 On Stabbing Lines for Convex Polyhedra in 3
Given a set B of convex polyhedra in R 3 , a linè in R 3 is called a stabbing line for B if it intersects all polyhedra of B. This paper presents an upper bound of O(n 3 logn) on the complexity of the space of stabbing lines for B. We solve a more general problem which counts the number of faces in a set of convex polyhedra, which are implicitly deened by a set of half-spaces and an arrangement...
متن کاملResearch Summary
In my doctoral dissertation (directed by W. P. Thurston) I studied the geometry of convex polyhedra in hyperbolic 3-space H3, and succeeded in producing a geometric characterization of dihedral angles of compact convex polyhedra by reducing the question to a convex isometric embedding problem in the De Sitter sphere, and resolving this problem. In particular, this produced a simple alternative ...
متن کاملUnfolding and Reconstructing Polyhedra
This thesis covers work on two topics: unfolding polyhedra into the plane and reconstructing polyhedra from partial information. For each topic, we describe previous work in the area and present an array of new research and results. Our work on unfolding is motivated by the problem of characterizing precisely when overlaps will occur when a polyhedron is cut along edges and unfolded. By contras...
متن کامل